Proof theory - PDFSEARCH.IO - Document Search Engine

Proof theory
Results: 1637

#	Item
651	Modal Proofs as Distributed Programs? (Extended Abstract) Limin Jia and David Walker Princeton University 35 Olden St., Princeton, NJ 08544, USA {ljia,dpw}@cs.princeton.edu Add to Reading List Source URL: www.andrew.cmu.edu Language: English - Date: 2014-11-11 20:30:18 Proof theory Non-classical logic Logic in computer science Semantics Deduction Natural deduction Modal logic Negation Sequent calculus Logic Mathematical logic Mathematics
652	Contents Part I The Basics Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-03-10 09:16:28 Complexity classes Circuit complexity Natural proof Switching lemma ACC0 NC P Binary decision diagram Clique Theoretical computer science Computational complexity theory Applied mathematics
653	A ‘theory’ mechanism for a proof-verifier based on first-order set theory ? Eugenio G. Omodeo1 and Jacob T. Schwartz2 1 2 Add to Reading List Source URL: www.multimedialibrary.com Language: English - Date: 2014-03-05 10:43:38 Functions and mappings Function Axiom schema of replacement First-order logic Equivalence relation Model theory Μ operator Primitive recursive function Mathematics Mathematical logic Logic
654	Efficient Dominance Testing for Unconditional Preferences Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2010-03-12 18:49:48 Net Constructible universe Turn Ordinal numbers Set theory Proof theory Topology Mathematical logic Mathematics General topology
655	Towards decidable classes of logic programs with function symbols Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna DIMES, Università della CalabriaRende (CS), Italy {calautti,greco,cmolinaro,trub Add to Reading List Source URL: www.imn.htwk-leipzig.de Language: English - Date: 2013-08-26 10:13:12 Metalogic Functions and mappings Predicate logic Proof theory Function Μ operator Well-formed formula Answer set programming Decidability Logic Mathematics Mathematical logic
656	COMS11700 Undecidability Ashley Montanaro Department of Computer Science, University of Bristol Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-05-31 09:18:34 Computability theory Theory of computation Alan Turing Turing machine Proof theory Undecidable problem Machine that always halts Decidability Church–Turing thesis Theoretical computer science Mathematics Mathematical logic
657	Workshop Programme Yago Antolin University of Southampton “Mineyev’s proof of the Hanna Neumann Conjecture.” In this talk we present the Igor Mineyev’s proof of the Strengthened Hanna Neumann conjecture. This pro Add to Reading List Source URL: www.personal.soton.ac.uk Language: English - Date: 2011-06-28 11:19:57 Algebra Relatively hyperbolic group Hyperbolic group Bass–Serre theory Hanna Neumann conjecture Group Borel subgroup Artin group Stallings theorem about ends of groups Abstract algebra Group theory Geometric group theory
658	MEP Pupil Text - Additional Material MEP Pupil Text - Additional Material: Mathematical Proof Mathematical Proof 1.1 True or False In this section we look at whether statements are true or false. The first point to Add to Reading List Source URL: www.cimt.plymouth.ac.uk Language: English - Date: 2005-08-11 11:57:53 Mathematical proofs Quantification Proof theory Existential quantification Mathematical fallacy Universal quantification Axiom Liar paradox Theorem Logic Mathematics Mathematical logic
659	A von Neumann algebra free proof of solid ergodicity for Bernoulli shifts Descriptive Set Theory Workshop ESI, October 2013 Robin D. Tucker-Drob Rutgers University Add to Reading List Source URL: www.math.rutgers.edu Language: English - Date: 2013-10-03 02:34:21 Mathematical analysis Probability and statistics Bernoulli scheme Ergodicity Borel equivalence relation Descriptive set theory Stochastic processes Statistics Ergodic theory
660	2 Typed Compilation Against Non-Manifest Base Classes Christopher League1 and Stefan Monnier2 1 Long Island University Add to Reading List Source URL: contrapunctus.net Language: English - Date: 2012-03-13 13:00:12 Proof theory Models of computation Logic in computer science Symbol Lambda calculus Curry–Howard correspondence Dynamical system Theoretical computer science Computer science Mathematics

UPDATE